Hamiltonian and long paths in bipartite graphs with connectivity

Let G be a graph, $\nu (G)$ the order of G, $\kappa (G)$ the connectivity of G and k a positive integer such that $k\le (\nu (G)?2)/2$. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets $V_1$ and $V_2$ is defined to be Hamiltonian-laceable if such that $|V_1|=|V_2|$ and for every pair of vertices $p\in V_1$ and $q\in V_2$, there exists a Hamiltonian path in G with endpoints p and q, or $|V_1|=|V_2|+1$ and for every pair of vertices $p,q\in V_1,p\ne q$, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition $(X,Y)$. Define $bn(G)$ to be a maximum integer such that $0\le bn(G)<min\{|X|,|Y|\}$ and (1) for each non-empty subset S of X, if $|S|\le |X|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|X|?bn(G)<|S|\le |X|$, then $N(S)=Y$; and (2) for each non-empty subset S of Y, if $|S|\le |Y|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|Y|?bn(G)<|S|\le |Y|$, then $N(S)=X$; and (3) $bn(G)=0$ if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|$ and $bn(G)>0$. In this paper, we show that if $\nu (G)\le 2\kappa (G)+4bn(G)?4$, then G is Hamiltonian-laceable; or if $\nu (G)>6bn(G)?2$, then for every pair of vertices $x\in X$ and $y\in Y$, there is an $(x,y)$-path P in G with $|V(P)|\ge 6bn(G)?2$. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.     

Theoretical study on the mechanism for the excited-state double proton transfer process of an asymmetric Schiff base ligand

Excited-state double proton transfer (ESDPT) in the 1-[(2-hydroxy-3-methoxy-benzylidene)-hydrazonomethyl]-naphthalen-2-ol (HYDRAVH₂) ligand was studied by the density functional theory and time-dependent density functional theory method. The analysis of frontier molecular orbitals, infrared spectra, and non-covalent interactions have cross-validated that the asymmetric structure has an influence on the proton transfer, which makes the proton transfer ability of the two hydrogen protons different. The potential energy surfaces in both S₀ and S₁ states were scanned with varying O-H bond lengths. The results of potential energy surface analysis adequately proved that the HYDRAVH₂ can undergo the ESDPT process in the S₁ state and the double proton transfer process is a stepwise proton transfer mechanism. Our work can pave the way towards the design and synthesis of new molecules.     

Pure annihilation decay of strange beauty meson into two charm heavy mesons

In this study, the heavy to heavy decay of \begin{document}$ B^0_s\rightarrow D^{*+}D^- $\end{document} is evaluated through the factorization approach by using the final state interaction as an effective correction. Under the factorization approach, this decay mode occurs only through the annihilation process, so a small amount is produced. Feynman's rules state that six meson pairs can be assumed for the intermediate states before the final meson pairs are produced. By taking into account the effects of twelve final state interaction diagrams in the calculations, a significant correction is obtained. These effects correct the value of the branching ratio obtained by the pure factorization approach from \begin{document}$ (2.41\pm1.37)\times10^{-5} $\end{document} to \begin{document}$ (8.27\pm2.23)\times10^{-5} $\end{document}. The value obtained for the branching ratio of the \begin{document}$ B^0_s\rightarrow D^{*+}D^- $\end{document} decay is consistent with the experimental results.     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].